Implementation of Different Square Root Algorithms
نویسندگان
چکیده
This paper presents the operation and the implementation of novel fixed point square root algorithms with an input range of 0 to 1 into CMOS. These algorithms are referred to as non-restoring and restoring algorithm and were compared with a square root implementation into a lookup table (LUT). The power consumption, the area consumption and the propagation delay were investigated and the results of all three algorithms are discussed in relation to their bitwidth for expedient implementation. These results enable hardware designers a fast exploration of the most suitable algorithm for a given application.
منابع مشابه
Decimal SRT Square Root: Algorithm and Architecture
Given the popularity of decimal arithmetic, hardware implementation of decimal operations has been a hot topic of research in recent decades. Besides the four basic operations, the square root can be implemented as an instruction directly in the hardware, which improves the performance of the decimal floating-point unit in the processors. Hardware implementation of decimal square rooters is usu...
متن کاملFloating Point Division and Square Root Algorithms and Implementation in the AMD-K7 Microprocessor
This paper presents the AMD-K7 IEEE 754 and x87 compliant floating point division and square root algorithms and implementation. The AMD-K7 processor employs an iterative implementation of a series expansion to converge quadratically to the quotient and square root. Highly accurate initial approximations and a high performance shared floating point multiplier assist in achieving low division an...
متن کاملImplementation of Integer Square Root
Square root plays a major role in applications like computer graphics, image processing. To increase the performance of computation, many algorithms have been proposed to carry out the computation task in hardware instead of software. One very common and relatively quick method for finding the square root of a number is the Newton-Raphson method which requires extensive use of division to produ...
متن کاملSoftware Division and Square Root Using Goldschmidt’s Algorithms
Goldschmidt’s Algorithms for division and square root are often characterized as being useful for hardware implementation, and lacking self-correction. A reexamination of these algorithms show that there are good software counterparts that retain the speed advantage of Goldschmidt’s Algorithm over the Newton-Raphson iteration. A final step is needed, however, to get the last bit rounded correctly.
متن کاملVariable Precision Floating-Point Divide and Square Root for Efficient FPGA Implementation of Image and Signal Processing Algorithms
Field Programmable Gate Arrays (FPGAs) are frequently used to accelerate signal and image processing algorithms due to their flexibility, relatively low cost, high performance and fast time to market. For those applications where the data has large dynamic range, floating-point arithmetic is desirable due to the inherent limitations of fixed-point arithmetic. Moreover, optimal reconfigurable ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007